Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
نویسندگان
چکیده
منابع مشابه
Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs
Let R=(r1, ..., rm) and S=(s1, ..., sn) be nonnegative integral vectors with ; ri=; sj. Let A(R, S) denote the set of all m×n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ]”. The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by ...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملDisjoint Cycles of Different Lengths in Graphs and Digraphs
In this paper, we study the question of finding a set of k vertex-disjoint cycles (resp. directed cycles) of distinct lengths in a given graph (resp. digraph). In the context of undirected graphs, we prove that, for every k > 1, every graph with minimum degree at least k 2+5k−2 2 has k vertex-disjoint cycles of different lengths, where the degree bound is best possible. We also consider other c...
متن کاملThe Diameter of Almost Eulerian Digraphs
Soares [J. Graph Theory 1992] showed that the well known upper bound 3 δ+1n+ O(1) on the diameter of undirected graphs of order n and minimum degree δ also holds for digraphs, provided they are eulerian. In this paper we investigate if similar bounds can be given for digraphs that are, in some sense, close to being eulerian. In particular we show that a directed graph of order n and minimum deg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2002
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2094